منابع مشابه
Space Exploration via Proximity Search
We investigate what computational tasks can be performed on a point set in R, if we are only given black-box access to it via nearest-neighbor search. This is a reasonable assumption if the underlying point set is either provided implicitly, or it is stored in a data structure that can answer such queries. In particular, we show the following: (A) One can compute an approximate bi-criteria k-ce...
متن کاملFiltration of String Proximity Search via Transformation
The problem of proximity search in biological databases is addressed. We study vectortransformations and conduct the application of DFT(Discrete Fourier Transformation) andDWT(Discrete Wavelet Transformation, Haar) dimensionality reduction techniques for DNAsequence proximity search to reduce the search time of range queries. Our empirical results on anumber of Prokaryote and Eu...
متن کاملEfficient search space exploration for sketch recognition
What: Sketch recognition is a natural form of interaction that has been receiving increasing attention in the research community [4], [1], [6]. One of the challenges in sketch recognition is efficient recognition. We propose to create efficient recognition by treating sketching as a dynamic process and by deriving recognition strategies from the object models specified in the language proposed ...
متن کاملGenetic Heuristic for Search Space Exploration
This paper deals wi th the way dual genetic algorithms ( D G A ) , an extension of the standard ones, explore the search space. After a brief introduction presenting genetic algorithms and dualism, the fitness distance correlation is discussed in the context of dualism. From this discussion, a conjecture is made about the genetic: heuristic used by dual genetic algorithms to explore the search ...
متن کاملNumeric Planning via Search Space Abstraction
Many real-world planning problems are best modeled as infinite search space problems, using numeric fluents. Unfortunately, most planners and planning heuristics do not directly support such fluents. We propose a search space abstraction technique that compiles a planning problem with numeric fluents into a finite state propositional planning problem. To account for the loss of precision result...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2016
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-016-9801-7